Cosine polynomials with restrictions on their algebraic representation
نویسندگان
چکیده
We prove that for any even algebraic polynomial $p$ one can find a cosine with an arbitrary small $l_1$-norm of coefficients such the first its representation as in $\cos x$ coincide those $p$.
منابع مشابه
On Nonnegative Cosine Polynomials with Nonnegative Integral Coefficients
We show that there exist Po > 0 ar>d P\, ■■■ , Pn nonnegative integers, such that 0 < p(x) = Po + Pi cosx + • ■ • + Pn cos Nx and po -C s1/3 for .s = J2'J=oPj < improving on a result of Odlyzko who showed the existence of such a polynomial p that satisfies Po < (.slogs)1/3 . Our result implies an improvement of the best known estimate for a problem of Erdos and Szekeres. As our method is noncon...
متن کاملOn Algebraic Polynomials with Random Coefficients
The expected number of real zeros and maxima of the curve representing algebraic polynomial of the form a0 (n−1 0 )1/2 + a1 (n−1 1 )1/2 x + a2 (n−1 2 )1/2 x2 + · · · + an−1 (n−1 n−1 )1/2 xn−1 where aj , j = 0, 1, 2, . . . , n − 1, are independent standard normal random variables, are known. In this paper we provide the asymptotic value for the expected number of maxima which occur below a given...
متن کاملMinimal Polynomials of Algebraic Cosine Values at Rational Multiples of π
Lehmer proved that the values of the cosine function evaluated at rational multiples of π are algebraic numbers. We show how to determine explicit, closed form expressions for the minimal polynomials of these algebraic numbers.
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملQRKE: Resistance to Attacks using the Inverse of the Cosine Representation of Chebyshev Polynomials
We've been able to show recently that Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers can be used to create a Diffie-Hellman-like key exchange algorithm and certificates. The cryptosystem was theoretically proven to withstand attacks using quantum computers. We additionally prove that attacks based on the inverse of the cosine representation of T polynomi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2022
ISSN: ['0021-9045', '1096-0430']
DOI: https://doi.org/10.1016/j.jat.2022.105802